Real - time Incremental Decision Tree Generation for Embedded Applications

نویسنده

  • David Mulvaney
چکیده

6 Abstract— This paper describes a frequency table-based decision tree algorithm for embedded applications. The table contains a compact statistical representation of the training set feature vectors and can be used in conjunction with a variety of learning methods. The use of the table allows a priori knowledge of the memory requirement and reduces the time for incremental tree generation by a factor of at least 10. The paper illustrates the method with an example of incremental decision tree learning applied to robot navigation. The performance of the method is compared with that of an existing incremental decision tree algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Generation for Real {

The acceptance of natural language generation systems strongly depends on their capability to facilitate the exchange of information with human users. Current generation systems consider the innuence of situational factors on the content and the form of the resulting utterances. However, the need to time their processing exibly is usually neglected although temporal factors play a central part ...

متن کامل

Incrementally Optimized Decision Tree for Mining Imperfect Data Streams

The Very Fast Decision Tree (VFDT) is one of the most important classification algorithms for real-time data stream mining. However, imperfections in data streams, such as noise and imbalanced class distribution, do exist in real world applications and they jeopardize the performance of VFDT. Traditional sampling techniques and post-pruning may be impractical for a non-stopping data stream. To ...

متن کامل

An Evolutionary Algorithm for Oblique Decision Tree Induction

In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to search for a splitting hyperplane. The feature selection is embedded into the algorithm, which allows to eliminate redundant and noisy features at each node. The experimental evaluation of the proposed approach is presente...

متن کامل

Policy Generation for Continuous-time Stochastic Domains with Concurrency

We adopt the framework of Younes, Musliner, & Simmons for planning with concurrency in continuous-time stochastic domains. Our contribution is a set of concrete techniques for policy generation, failure analysis, and repair. These techniques have been implemented in TEMPASTIC, a novel temporal probabilistic planner, and we demonstrate the performance of the planner on two variations of a transp...

متن کامل

Incremental Search Algorithms for Real - Time Decision MakingJoseph

We propose incremental, real-time search as a general approach to real-time decision making. We model real-time decision making as incremental tree search with a limited number of node expansions between decisions. We show that the decision policy of moving toward the best frontier node is not optimal, but nevertheless performs nearly as well as an expected-value-based decision policy. We also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005